Reachability in Cooperating Systems with Architectural Constraints is PSPACE-Complete
نویسندگان
چکیده
منابع مشابه
Reachability in Cooperating Systems with Architectural Constraints is PSPACE-Complete
The reachability problem in cooperating systems is known to be PSPACE-complete. We show here that this problem remains PSPACE-complete when we restrict the communication structure between the subsystems in various ways. For this purpose we introduce two basic and incomparable subclasses of cooperating systems that occur often in practice and provide respective reductions. The subclasses we cons...
متن کاملReachability in Tree-Like Component Systems is PSPACE-Complete
The reachability problem in component systems is PSPACEcomplete. We show here that even the reachability problem in the subclass of component systems with “tree-like” communication is PSPACEcomplete. For this purpose we reduce the question if a Quantified Boolean Formula (QBF) is true to the reachability problem in “tree-like” component systems.
متن کاملReachability in Two-Clock Timed Automata Is PSPACE-Complete
A recent result has shown that reachability in two-clock timed automata is log-space equivalent to reachability in bounded onecounter automata [6]. We show that reachability in bounded one-counter automata is PSPACE-complete.
متن کاملEverything Is PSPACE-Complete in Interaction Systems
We study complexity issues for interaction systems, a general model for component-based systems that allows for a very flexible interaction mechanism. We present complexity results for important properties of interaction systems such as local/global deadlock-freedom, progress and availability of components.
متن کاملEntailment of Atomic Set Constraints is PSPACE-Complete
The complexity of set constraints has been extensively studied over the lastyears and was often found quite high. At the lower end of expressiveness, there areatomic set constraints which are conjunctions of inclusionst1 t2 between first-order terms without set operators. It is well-known that satisfiability of atomic setconstraints can be tested in cubic time. Also, ent...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2013
ISSN: 2075-2180
DOI: 10.4204/eptcs.138.1